996C - Tesla - CodeForces Solution

#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#define ll long long
#define pb push_back
using namespace std;
template <typename T>
void debug (T x, string sir)
{
    cout << sir << " este " << x << '\n';
}
int m[5][51];
struct element
{
    int nr;
    int x;
    int y;
};
vector<element> rasp;
void mutare (int a,int b,int c,int d)
{
    if(!m[a][b])
        return;
    if(m[c][d])
        return;
    if (a==2)
    {
        if (m[1][b] == m[a][b])
            return;
    }
    if (a==3)
    {
        if (m[4][b] == m[a][b])
            return;
    }
    swap(m[a][b],m[c][d]);
    element aux;
    aux.nr = m[c][d];
    aux.x = c;
    aux.y = d;
    rasp.pb(aux);
}
void solve()
{
    int n,k;
    cin >> n >> k;
    for (int i=1;i<=4;i++)
        for(int j=1;j<=n;j++)
            cin >> m[i][j];
    while(k)
    {
        for (int i=1;i<=n;i++)
        {
            if (m[2][i] && m[1][i] == m[2][i])
            {
                k--;
                element aux;
                aux.nr = m[2][i];
                aux.x = 1;
                aux.y = i;
                rasp.pb(aux);
                m[2][i] = 0;
            }
            if (m[3][i] && m[4][i] == m[3][i])
            {
                k--;
                element aux;
                aux.nr = m[3][i];
                aux.x = 4;
                aux.y = i;
                rasp.pb(aux);
                m[3][i] = 0;
            }
        }
        if (k==2*n)
        {
            cout << "-1";
            return;
        }
        for (int i=1;i<n;i++)
            mutare(2,i,2,i+1);
        mutare(2,n,3,n);
        for (int i=n;i>1;i--)
            mutare(3,i,3,i-1);
        if (rand()%3==0 && m[3][1]!=m[4][1])
            mutare(3,1,2,1);
    }
    cout << rasp.size() << '\n';
    for (auto element : rasp)
        cout << element.nr << ' ' << element.x << ' ' << element.y << '\n';
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //cin >> t;
    while (t)
    {
        t--;
        solve();
    }
    return 0;
}